Delta T: Polynomial Approximation of Time Period 1620–2013
نویسندگان
چکیده
منابع مشابه
Polynomial-Time Approximation Schemes
We present the first polynomial-time approximation schemes (PTASes) for the following subset-connectivity problems in edge-weighted graphs of bounded genus: Steiner tree, low-connectivity survivable-network design, and subset TSP. The schemes run in O(n log n) time for graphs embedded on both orientable and nonorientable surfaces. This work generalizes the PTAS frameworks of Borradaile, Klein, ...
متن کاملPolynomial-Time Approximation Algorithms
• Assume that the input is random, and find an algorithm that will perform well in the average case. For example, the maximum clique problem, which is NP -hard, can actually be solved efficiently assuming a random input because the maximum clique in a randomly chosen graph is small. This assumption is often used in practice, but the problem is that not everyone will agree on whether the input d...
متن کاملA Polynomial Time Approximation
In this paper we study the following problem: Given n strings s1; s2; : : : ; sn, each of length m, nd a substring ti of length L for each si, and a string s of length L, such that max n i=1 d(s; ti) is minimized, where d(;) is the Hamming distance. The problem was raised in 6] in an application of genetic drug target search and is a key open problem in many applications 7]. The authors of 6] s...
متن کاملPolynomial-Time Approximation Schemes
Let Π be an NP-hard optimization problem, and let A be an approximation algorithm for Π. For an instance I of Π, let A(I) denote the objective value when running A on I, and let OPT (I) denote the optimal objective value. The approximation ratio of A for the instance I is RA(I) = A(I)/OPT (I), thus, when Π is minimization (maximization) problem RA(I) ≥ 1 (RA(I) ≤ 1). A polynomial time approxima...
متن کاملFully Polynomial Time Approximation Schemes
Recall that the approximation ratio for an approximation algorithm is a measure to evaluate the approximation performance of the algorithm. The closer the ratio to 1 the better the approximation performance of the algorithm. It is notable that there is a class of NP-hard optimization problems, most originating from scheduling problems, for which there are polynomial time approximation algorithm...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Astrophysics
سال: 2014
ISSN: 2356-718X,2314-6192
DOI: 10.1155/2014/480964